Edge flipping in the complete graph
نویسندگان
چکیده
منابع مشابه
Edge flipping in the complete graph
We consider the following random process on the complete graph: repeatedly draw edges (with replacement) and with probability p assign the vertices of the edge blue and with probability 1 − p assign the vertices of the edge red. This is a random walk on a state space of red/blue colorings of the complete graph and so has a stationary distribution. We derive this stationary distribution as well ...
متن کاملThe edge-flipping group of a graph
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move applied to a configuration is to select a black edge 2 ∈ E and change the colors of all adjacent edges of 2. Given an initial configuration and a final configuration, try to find a sequence of moves that transforms the in...
متن کاملEdge flipping in graphs
In this paper we investigate certain random processes on graphs first suggested by Persi Diaconis. These processes are related to the so-called Tsetlin library random walk as well as to some variants of the classical voter model. A specific example of what we study is the following. Suppose we begin with some finite graph G in which each vertex of G is initially arbitrarily colored red or blue....
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2015
ISSN: 0196-8858
DOI: 10.1016/j.aam.2015.06.002